Mapping Concurrently-Communicating Modules onto Mesh Multicomputers Equipped with Virtual Channels
نویسندگان
چکیده
|It is diicult to deene and evaluate a meaningful performance metric when many packets are generated and exchanged concurrently in mesh-connected multicomputers equipped with wormhole switching and virtual channels. Thus, an approximate metric/cost function must be chosen so that when task modules are mapped by optimizing this function, the actual performance of the mapping is also optimized. Several low-complexity cost functions are evaluated using the simulated annealing optimization process. The mappings found by optimizing these cost functions are then fed into a it-level simulator to evaluate their actual performance. One particular cost function is found to be very eeective.
منابع مشابه
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
This paper addresses the problem of fault-tolerant mul-ticast routing in wormhole-routed multicomputers. We present a new pseudo-Hamiltonian path-based routing methodology for constructing deadlock-free multicast routing algorithms requiring no virtual channels. This technique is applied to construct the rst fault-tolerant multicast routing algorithm for the mesh that requires no virtual channe...
متن کاملHypercube Algorithms on Mesh Connected Multicomputers
A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are ...
متن کاملAdaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملVirtual Prototyping For Modular And Flexible Hardware-Software Systems
The goal of this work is to develop a methodology for fast prototyping of highly modular and flexible electronic systems including both, software and hardware. The main contribution of this work is the ability to handlea wide range of architectures. We assumethat hardware/softwarepartitioning is alreadymade. This stage of the codesign process starts with a virtual prototype, an heterogeneousarc...
متن کاملOrigin-Based Fault-Tolerant routing in the Mesh
The ability to tolerate faults is critical in multicomputers employing large numbers of processors. This paper describes a class of fault-tolerant routing algorithms for n-dimensional meshes that can tolerate large numbers of faults without using virtual channels. We show that these routing algorithms prevent livelock and deadlock while remaining highly adaptive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995